Semismooth Methods for Linear and Nonlinear Second-order Cone Programs
نویسندگان
چکیده
The optimality conditions of a nonlinear second-order cone program can be reformulated as a nonsmooth system of equations using a projection mapping. This allows the application of nonsmooth Newton methods for the solution of the nonlinear second-order cone program. Conditions for the local quadratic convergence of these nonsmooth Newton methods are investigated. Related conditions are also given for the special case of a linear second-order cone program. An interesting and important feature of these conditions is that they do not require strict complementarity of the solution. Some numerical results are included in order to illustrate the theoretical considerations.
منابع مشابه
On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
The optimality conditions of a nonlinear second-order cone program can be reformulated as a nonsmooth system of equations using a projection mapping. This allows the application of nonsmooth Newton methods for the solution of the nonlinear second-order cone program. Conditions for the local quadratic convergence of these nonsmooth Newton methods are investigated. Related conditions are also giv...
متن کاملAdvanced Optimization Laboratory Title: An Algorithm for Perturbed Second-order Cone Programs
The second-order cone programming problem is reformulated into several new systems of nonlinear equations. Assume the perturbation of the data is in a certain neighborhood of zero. Then starting from a solution to the old problem, the semismooth Newton’s iterates converge Q-quadratically to a solution of the perturbed problem. The algorithm is globalized. Numerical examples show that the algori...
متن کاملThe SC1 property of the squared norm of the SOC Fischer-Burmeister function
We show that the gradient mapping of the squared norm of Fischer-Burmeister function is globally Lipschitz continuous and semismooth, which provides a theoretical basis for solving nonlinear second order cone complementarity problems via the conjugate gradient method and the semismooth Newton’s method.
متن کاملSuccessive Linearization Methods for Nonlinear Semidefinite Programs
We present a successive linearization method with a trust region-type globalization for the solution of nonlinear semidefinite programs. At each iteration, the method solves a quadratic semidefinite program, which can be converted to a linear semidefinite program with a second order cone constraint. A subproblem of this kind can be solved quite efficiently by using some recent software for semi...
متن کاملA least-square semismooth Newton method for the second-order cone complementarity problem
We present a nonlinear least-square formulation for the second-order cone complementarity problem based on the Fischer-Burmeister (FB) function and the plus function. The formulation has twofold advantages. Firstly, the operator involved in the overdetermined system of equations inherits the favorable properties of the FB function for local convergence, for example, the (strong) semismoothness....
متن کامل